Marginally compact fractal trees with semiflexibility
نویسندگان
چکیده
منابع مشابه
Fractal Trees with Side Branching
This paper considers fractal trees with self-similar side branching. The Tokunaga classification system for side branching is introduced, along with the Tokunaga self-similarity condition. Area filling (D = 2) and volume filling (D = 3) deterministic fractal tree constructions are introduced both with and without side branching. Applications to diffusion limited aggregation (DLA), actual draina...
متن کاملGeometry of proteins: hydrogen bonding, sterics, and marginally compact tubes.
The functionality of proteins is governed by their structure in the native state. Protein structures are made up of emergent building blocks of helices and almost planar sheets. A simple coarse-grained geometrical model of a flexible tube barely subject to compaction provides a unified framework for understanding the common character of globular proteins. We argue that a recent critique of the ...
متن کاملA compact stacked Quasi-fractal microstrip antenna for RFID applications
In this paper, we propose a new compact quasi-fractal shaped microstrip antenna that consists of a hexagonal patch as the main radiator and a complementary stacked patch as the parasitic element. The overall surface of the proposed quasi-fractal patch is about 55% lower than the conventional hexagonal patch. Using of stacked technique, the gain reduction of compression technique is almost compe...
متن کاملMost Compact Parsimonious Trees
Construction of phylogenetic trees has traditionally focused on binary trees where all species appear on leaves, a problem for which numerous efficient solutions have been developed. Certain application domains though, such as viral evolution and transmission, paleontology, linguistics, and phylogenetic stemmatics, often require phylogeny inference that involves placing input species on ancestr...
متن کاملCompact O-complete Trees
In this paper, a novel am to ordered retrieval in very large files is developed. The method employs a B-tree like search algorithm that is independent of key type or key length because all keys in index blocks are encoded by a lo&f bit surrogate, where M is the maximal key length. For example, keys of length less than 32 bytes can be represented by a single byte in the index. This ensures a max...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2017
ISSN: 2470-0045,2470-0053
DOI: 10.1103/physreve.96.012501